APRE: A Replication Method for Unstructured P2P Networks

نویسندگان

  • Dimitrios Tsoumakos
  • Nick Roussopoulos
چکیده

We present APRE, a replication method for structureless Peer-to-Peer overlays. The goal of our method is to achieve real-time replication of even the most sparsely located content relative to demand. APRE adaptively expands or contracts the replica set of an object in order to improve the sharing process and achieve a low load distribution among the providers. To achieve that, it utilizes search knowledge to identify possible replication targets inside query-intensive areas of the overlay. We present detailed simulation results where APRE exhibits both efficiency and robustness relative to the number of requesters and the respective request rates. The scheme proves particularly useful in the event of flash crowds, managing to quickly adapt to sudden surges in load.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Adaptive Probabilistic Replication Method for Unstructured P2P Networks

We present APRE, a replication method for unstructured Peer-to-Peer overlays. The goal of our method is to achieve real-time replication of even the most sparsely located content relative to demand. APRE adaptively expands or contracts the replica set of an object in order to improve the sharing process and achieve a low load distribution among the providers. To achieve that, it utilizes search...

متن کامل

Search , Replication and Grouping for Unstructured P 2 P Networks

Title of dissertation: SEARCH, REPLICATION AND GROUPING FOR UNSTRUCTURED P2P NETWORKS Dimitrios Tsoumakos, Doctor of Philosophy, 2006 Dissertation directed by: Professor Nicholas Roussopoulos Department of Computer Science In my dissertation, I present a suite of protocols that assist in efficient content location and distribution in unstructured Peer-to-Peer overlays. The basis of these scheme...

متن کامل

Survey of Search and Replication Schemes in Unstructured P2P Networks

P2P computing lifts taxing issues in various areas of computer science. The largely used decentralized unstructured P2P systems are ad hoc in nature and present a number of research challenges. In this paper, we provide a comprehensive theoretical survey of various state-of-the-art search and replication schemes in unstructured P2P networks for file-sharing applications. The classifications of ...

متن کامل

Review of Replication Schemes for Unstructured P2P Networks

To improve unstructured P2P system performance, one wants to minimize the number of peers that have to be probed for the shortening of the search time. A solution to the problem is to employ a replication scheme, which provides high hit rate for target files. Replication can also provide load balancing and reduce access latency if the file is accessed by a large population of users. This paper ...

متن کامل

Popularity-Based Replication Strategy in Unstructured P2P File Sharing Systems

Peer-to-Peer (P2P) networks have shown to be an efficient and successful mechanism for file sharing over the internet. The unstructured P2P systems usually use a blind search method to find the requested data object. Observations have shown that a few of peers share most of data. In order to increase the success rate of blind search and data availability and load balancing, replication techniqu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006